package tut.binnaryTree.base;

public class Node {
    private int key;
    private Node left, right;

    public Node(int key, Node left, Node right) {
        this.key = key;
        this.left = left;
        this.right = right;
    }

    public int getKey() {
    	return key;
    }

    public Node getLeft() {
    	return left;
    }

    public Node getRight() {
    	return right;
    }

    // mutators (change fields)
    public void setKey(int key) {
    	this.key = key;
    }

    public void setLeft(Node left) {
    	this.left = left;
    }

    public void setRight(Node right) {
    	this.right = right;
    }

}
